Mosaic Ranks for the Inverses to Band Matrices

نویسنده

  • E E Tyrtyshnikov
چکیده

After reminding the de nition of mosaic ranks we estimate them from above for the inverses to band matrices The estimate grows logarithmically with the matrix size The result presented in this note should be compared with the well known descriptions of the inverses to band matrices as semisep arable matrices Our approach still excells in that it holds under much weaker assumptions Introduction To begin with we remind some de nitions and well known facts Let p q n We say that A aij nij is a p q band matrix if aij whenever i j p or i j q It is very important what comes along the extreme diagonals i j p and i j q If there is a nonzero entry on each of them then p and q are correctly de ned upper and lower bandwidth If all their entries are nonze roes then A is called a strict p q band matrix This work was supported in part by the Russian Fund of Basic Research and the Volkswagen Stiftung Denote by Up and Lq the spaces of upper and lower triangular matrices of order p and q respectively We say that A is a q p semiseparable matrix if rst A S U rankS q U Un q and second A R L rankR p L Ln p It is known for years that the inverses to band matrices still capture rather imposing structure We all are aware of the following beautiful well known and rediscovered several times theorem A nonsingular matrix is a strict p q band matrix if and only if its in verse is a q p semiseparable matrix The proof can be found for example in see also How ever in contrast to the de nition and proof given in we need not to assume additionally that the diagonals i j q in S and R and i j p also are entry wise di erent The above theorem can be proved without this In fact the proof can be very short and clear Suppose rst that A is a nonsingular q p semiseparable matrix Rewrite in the block form A u v u v U u v u v We conclude immediately that the blocks u and v are nonsingular The Schur complement to the block is u v U u v u v u v U It implies that U is nonsingular and A U Using the same arguments from we derive that A L which completes the proof of the only if part The idea goes back probably to D K Faddeev Concerning the if part set A a b U c and remember the Frobenius formulas with h b aU c it holds that A U ch U U chaU h haU Still one ought to recover from this that

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rank Equalities Related to Generalized Inverses of Matrices and Their Applications

This paper is divided into two parts. In the first part, we develop a general method for expressing ranks of matrix expressions that involve Moore-Penrose inverses, group inverses, Drazin inverses, as well as weighted Moore-Penrose inverses of matrices. Through this method we establish a variety of valuable rank equalities related to generalized inverses of matrices mentioned above. Using them,...

متن کامل

A short note on the nullity theorem

In this paper we take a close look at the nullity theorem as formulated by Markham and Fiedler in 1986. The theorem is a valuable tool in the computations with structured rank matrices, it connects ranks of subblocks of an invertible matrix A with ranks of other subblocks in his inverse A. A little earlier, Barrett and Feinsilver, 1981, proved a theorem very close to the nullity theorem, but re...

متن کامل

Formulas for calculating the maximum and minimum ranks of products of generalized inverses of matrices

Abstract. A matrix X is called an {i, . . . , j}-inverse of A, denoted by A, if it satisfies the ith,. . . , jth equations of the four matrix equations (i) AXA = A, (ii) XAX = X, (iii) (AX)∗ = AX, (iv) (XA)∗ = XA. The {i, . . . , j}-inverse of A is not necessarily unique and their general expressions can be written as certain linear or quadratical matrix-valued functions that involve one or mor...

متن کامل

Max-min ranks of products of two matrices and their generalized inverses

The present author recently established (J. Inequal. Appl., DOI: 10.1186/s13660016-1123-z) a group of exact formulas for calculating the maximum and minimum ranks of the products BA, and derived many algebraic properties of BA from the formulas, where A and B are two complex matrices such that the product AB is defined, and A and B are the {i, . . . , j}-inverses of A and B, respectively. As a ...

متن کامل

On generalized inverses of banded matrices

Bounds for the ranks of upper-right submatrices of a generalized inverse of a strictly lower k-banded matrix are obtained. It is shown that such ranks can be exactly predicted under some conditions. The proof uses the Nullity Theorem and bordering technique for generalized inverse.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007